Nonseparating Cycles Avoiding Specific Vertices

نویسندگان

  • Yanmei Hong
  • Liying Kang
  • Xingxing Yu
چکیده

Thomassen proved that every (k + 3)-connected graph G contains an induced cycle C such that G − V (C) is k-connected, establishing a conjecture of Lovász. In general, one could ask the following question: For any positive integers k, l, does there exist a smallest positive integer g(k, l) such that for any g(k, l)-connected graph G, any X ⊆ V (G) with |X| = k, and any e ∈ E(G − X), there is an induced cycle C in G − X such that e ∈ E(C) and G− V (C) is l-connected? The case when k = 0 is a well-known conjecture of Lovász which is still open for l ≥ 3. In this paper, we prove g(k, 1) ≤ 10k + 1 and g(k, 2) ≤ 10k + 11. We also consider a weaker version: For any positive integers k, l, is there a smallest positive integer f(k, l) such that for every f(k, l)-connected graph G and any X ⊆ V (G) with |X| = k, there is an induced cycle C in G−X such that G− V (C) is l-connected? The case when k = 0 was studied by Thomassen. We prove f(k, l) ≤ 2k+l+2 and f(k, 1) = k + 3.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A 9k Kernel for Nonseparating Independent Set in Planar Graphs

We study kernelization (a kind of efficient preprocessing) for NP-hard problems on planar graphs. Our main result is a kernel of size at most 9k vertices for the Planar Maximum Nonseparating Independent Set problem. A direct consequence of this result is that Planar Connected Vertex Cover has no kernel with at most (9/8 − ǫ)k vertices, for any ǫ > 0, assuming P 6= NP. We also show a very simple...

متن کامل

Graph Connectivity After Path Removal

Let G be a graph and u, v be two distinct vertices of G. A u−v path P is called nonseparating if G − V (P ) is connected. The purpose of this paper is to study the number of nonseparating u− v path for two arbitrary vertices u and v of a given graph. For a positive integer k, we will show that there is a minimum integer α(k) so that if G is an α(k)-connected graph and u and v are two arbitrary ...

متن کامل

Shortest Co-cycle Bases of Graphs

In this paper we investigate the structure of the shortest co-cycle base(or SCB in short) of connected graphs, which are related with map geometries, i.e., Smarandache 2dimensional manifolds. By using a Hall type theorem for base transformation, we show that the shortest co-cycle bases have the same structure (there is a 1-1 correspondence between two shortest co-cycle bases such that the corre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Graph Theory

دوره 80  شماره 

صفحات  -

تاریخ انتشار 2015